Mersenne version of Brocard-Ramanujan equation
نویسندگان
چکیده
In this study, we deal with a special form of the Brocard-Ramanujan equation, which is one interesting and still open problems Diophantine analysis. We search for positive integer solutions equation case where right-hand side Mersenne numbers. By using definition numbers, appropriate inequalities parameters prime factorization $n!$ show that there no solution to equation. Thus, obtain result demonstrating square any number can not be expressed as $n!+1$.
منابع مشابه
Variants of the Brocard-Ramanujan equation
In this paper, we discuss variations on the BrocardRamanujan Diophantine equation.
متن کاملTribonacci Numbers and the Brocard - Ramanujan Equation
Let (Tn)n≥0 be the Tribonacci sequence defined by the recurrence Tn+2 = Tn+1 + Tn + Tn−1, with T0 = 0 and T1 = T2 = 1. In this short note, we prove that there are no integer solutions (u,m) to the Brocard-Ramanujan equation m! + 1 = u2 where u is a Tribonacci number.
متن کاملGaussian Mersenne and Eisenstein Mersenne primes
The Biquadratic Reciprocity Law is used to produce a deterministic primality test for Gaussian Mersenne norms which is analogous to the Lucas–Lehmer test for Mersenne numbers. It is shown that the proposed test could not have been obtained from the Quadratic Reciprocity Law and Proth’s Theorem. Other properties of Gaussian Mersenne norms that contribute to the search for large primes are given....
متن کاملStability of Brocard Points of Polygons
A continuous nested sequence of similar triangles converging to the Brocard point of a given triangle is investigated. All these triangles have the same Brocard point. For polygons, the Brocard point need not exist, but there is always a limit object for an analogously defined nested sequence of inner polygons. This limit object is a Brocard point if and only if the inner polygons are all simil...
متن کاملGeneralised Mersenne Numbers Revisited
Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attractive choice for modular multiplication implementation. However, the issue of residue multiplication efficiency seems to have been overlooked....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of new results in science
سال: 2023
ISSN: ['1304-7981']
DOI: https://doi.org/10.54187/jnrs.1219721